SSD: Smooth Signed Distance Surface Reconstruction
نویسندگان
چکیده
We introduce a new variational formulation for the problem of reconstructing a watertight surface defined by an implicit equation, from a finite set of oriented points; a problem which has attracted a lot of attention for more than two decades. As in the Poisson Surface Reconstruction approach, discretizations of the continuous formulation reduce to the solution of sparse linear systems of equations. But rather than forcing the implicit function to approximate the indicator function of the volume bounded by the implicit surface, in our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface. Since an indicator function is discontinuous, its gradient does not exist exactly where it needs to be compared with the normal vector data. The smooth signed distance has approximate unit slope in the neighborhood of the data points. As a result, the normal vector data can be incorporated directly into the energy function without implicit function smoothing. In addition, rather than first extending the oriented points to a vector field within the bounding volume, and then approximating the vector field by a gradient field in the least squares sense, here the vector field is constrained to be the gradient of the implicit function, and a single variational problem is solved directly in one step. The formulation allows for a number of different efficient discretizations, reduces to a finite least squares problem for all linearly parameterized families of functions, and does not require boundary conditions. The resulting algorithms are significantly simpler and easier to implement, and produce results of quality comparable with state-of-the-art algorithms. An efficient implementation based on a primal-graph octree-based hybrid finite element-finite difference discretization, and the Dual Marching Cubes isosurface extraction algorithm, is shown to produce high quality crack-free adaptive manifold polygon meshes.
منابع مشابه
SSD-C: Smooth Signed Distance Colored Surface Reconstruction
In this chapter we address the problem of reconstructing the surface geometry, topology, and color map of a 3D scene from a finite set of colored oriented points. These data sets are nowadays obtained using a variety of techniques, including multi-view stereo reconstruction methods from multiple 2D images. We describe a novel variational method which reduces the problem to the solutions of spar...
متن کاملA Variational Taxonomy for Surface Reconstruction from Oriented Points
The problem of reconstructing a watertight surface from a finite set of oriented points has received much attention over the last decades. In this paper, we propose a general higher order framework for surface reconstruction. It is based on the idea that position and normal defined by each oriented point can be used to construct an implicit local description of the unknown surface. On the one h...
متن کامل3D Surface Reconstruction from Unorganized Sparse Cross Sections
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...
متن کاملMultivariate spline approximation of the signed distance function
The signed distance function can effectively support many geometry processing tasks such as decimates, smoothing and shape reconstruction since it provides efficient access to distance estimates. In this talk, we present an adaptive method to approximate the signed distance function of a smooth curve by using polynomial splines over type-2 triangulation. The trimmed offsets are also studied.
متن کاملA Second-Order Accurate Method for Solving the Signed Distance Function Equation
We present a numerical method for computing the signed distance to a piecewise-smooth surface defined as the zero set of a function. It is based on a marching method by Kim [Kim01] and a hybrid discretization of firstand second-order discretizations of the signed distance function equation. If the solution is smooth at a point and at all of the points in the domain of dependence of that point, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 30 شماره
صفحات -
تاریخ انتشار 2011